Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors

This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...

متن کامل

Parallel Multifrontal Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors

We describe the issues involved in the design and implementation of eecient parallel algorithms for solving sparse linear least squares problems on distributed-memory multiprocessors. We consider both the QR factorization method due to Golub and the method of corrected semi-normal equations due to Bjj orck. The major tasks involved are sparse QR factorization, sparse triangular solution and spa...

متن کامل

Parallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory

This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...

متن کامل

Solving Sparse Least Squares Problems on Massively Distributed Memory Computers

In this paper we study the parallel aspects of PCGLS, a basic iterative method whose main idea is to organize the computation of conjugate gradient method with preconditioner applied to normal equations, and Incomplete Modified Gram-Schmidt (IMGS) preconditioner for solving sparse least squares problems on massively parallel distributed memory computers. The performance of these methods on this...

متن کامل

Exact Solution of Linear Equations on Distributed-memory Multiprocessors

We p resent two new parallel algorithms for exact error-free solution of a system of linear equations on a distributed-memory multiprocessor. The exact solution is obtained using the congruence technique which consists of two steps: First, the system of linear equations is converted to systems of linear congruence equations with respect to several prime moduli, and each of these systems is solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Parallel Computing

سال: 1997

ISSN: 0167-8191

DOI: 10.1016/s0167-8191(97)00064-1